Improved matrix dilations for robust semidefinite programming, Report no. LiTH-ISY-R-2753
نویسنده
چکیده
Simple improvements to an approach for robust semidefinite programming are proposed. The matrix dilation reformulation used as the core idea in a work by Oishi [5] is improved in terms of computational complexity by applying standard sum-of-squares methods, and by introducing less conservative uncertainty dependent parameterizations of the dilation matrix.
منابع مشابه
On Polynomial Coefficients and Rank Constraints, Report no. LiTH-ISY-R-2867
Rank constraints on matrices emerge in many automatic control applications. In this short document we discuss how to rewrite the constraint into a polynomial equations of the elements in a the matrix. If addition semidefinite matrix constraints are included, the polynomial equations can be turned into an inequality. We also briefly discuss how to implement these polynomial constraints.
متن کاملOn Polynomial Coefficients and Rank Constraints, Report no. LiTH-ISY-R-2878
Rank constraints on matrices emerge in many automatic control applications. In this short document we discuss how to rewrite the constraint into a polynomial equations of the elements in a the matrix. If addition semidefinite matrix constraints are included, the polynomial equations can be turned into an inequality. We also briefly discuss how to implement these polynomial constraints.
متن کاملA Decomposition Algorithm for KYP-SDPs, Report no. LiTH-ISY-R-2919
In this paper, a structure exploiting algorithm for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma, where some of the constraints appear as complicating constraints is presented. A decomposition algorithm is proposed, where the structure of the problem can be utilized. In a numerical example, where a controller that minimizes the sum of the H2-norm and the H∞-norm is desig...
متن کاملLowrank exploitation in semidefinite programming for control, Report no. LiTH-ISY-R-2927
Many control related problems can be cast as semidefinite programs but, even though there exist polynomial time algorithms and good publicly available solvers, the time it takes to solve these problems can be long. Something many of these problems have in common, is that some of the variables enter as matrix valued variables. This leads to a low-rank structure in the basis matrices which can be...
متن کاملPerformance Analysis of Robust Averaging Level Control, Report no. LiTH-ISY-R-3030
Frequent inlet flow changes, especially in the same direction, typically cause problems for averaging level controllers. To obtain optimal flow filtering while being robust towards future inlet flow upsets closed loop robust MPC was used. Its performance and robustness is analyzed and compared to the optimal averaging level controller. The knowledge gained from the robust MPC exercise is also u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006